Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Jurnal Komputasi

Penelusuran Bug Program Simulasi Pencetakan Transkrip SIAKAD Unila dengan Metode Whitebox dan Solusi Menggunakan Variabel Memori Sakethi, Dwi; Wamiliana, Wamiliana; Wardhana, Wisnu; Zahroh, Alifah
Jurnal Komputasi Vol 3, No 1 (2015)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v3i1.978

Abstract

AbstractIn tracking of SIAKAD transcript, there was found a bug, that is the arrangement of the lesson position at the tenth till fifteenth semester located between first and second semester. Process tracking bug did in simulation program. In this research, carried out a development of the original program Siakad as simulation program that will be analyzed, to find out where is bug in the system. Development this program using PHP and MySQL database software. Tracking bug using whitebox testing method, it can be determined whether there is a bug in the procedural structure of the program or just on the operational function of the system itself. Bugs can be repaired by adding some changes on source code of the program. The changes are determination of new variables as memory variables and application of Bubble sort method on sorting proccess. The result shows bugs on the program is fixed. Keywords: Bubble sort, Bug, MySQL, PHP, Siakad, Whitebox
ANALISIS PERBANDINGAN ALGORITMA ASIMETRIS ELGAMAL DAN MASSEY-OMURA DALAM ENKRIPSI DAN DEKRIPSI DATA Wijaya, Ahmad Adi; Wamiliana, Wamiliana; Andrian, Rico
Jurnal Komputasi Vol 4, No 1 (2016)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v4i1.1154

Abstract

Information can be kept secure by an encryption process in cryptograpy technigue. In this research we discussed comparative analysis of asymmetric algorithms ElGamal and Massey-Omura in terms of their complexities, time, and speed performances. The testing was conducted using 30 data with size  varies between 66 bytes and 2000 bytes. Thirty data were tested 50 times. The result shows that Elgamal Algorithm is faster in encryption and decryption compared to Massey-Omura Algorithm and the complexity of both algorithms are linear algorithms (O (n)).
IMPLEMENTASI ALGORITMA BACKTRACK UNTUK PENCARIAN SOLUSI KNIGHT’S TOUR PROBLEM PADA PAPAN CATUR m x n Wamiliana, Wamiliana; Kurniasari, Dian; Yudhistira, Dolly
Jurnal Komputasi Vol 1, No 1 (2013)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23960/komputasi.v1i1.397

Abstract

This research discusses about finding all solutions of The Knight's Tour Problem. The steps done by a knight on a chess board forms a path. If the track is able to pass through all points (boxes)  and can return to the original point (box)  is called as Hamilton Cycle, that produces Closed Knight's Tour;  if the path can pass through all the points but can not return to the original point of the track is called as Open Knight's Tour. There are various ways to solve the Knight's Tour Problem, one of which is to use the Backtrack algorithm. In this paper we will discuss of finding all solutions of Knight’s Tour Problem vary from 3x3 up to 8x8 chessboards.Keywords: knight’s tour problem, backtrack algorithm, open and closed knight’s tour